Probabilistic Point Cloud Modeling via Self-Organizing Gaussian Mixture Models

نویسندگان

چکیده

This letter presents a continuous probabilistic modeling methodology for spatial point cloud data using finite Gaussian Mixture Models (GMMs) where the number of components are adapted based on scene complexity. Few hierarchical and adaptive methods have been proposed to address challenge balancing model fidelity with size. Instead, state-of-the-art mapping approaches require tuning parameters specific use cases, but do not generalize across diverse environments. To this gap, we utilize self-organizing principle from information-theoretic learning automatically adapt complexity GMM relevant information in sensor data. The approach is evaluated against existing techniques real-world varying degrees

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-organizing mixture models

We present an expectation-maximization (EM) algorithm that yields topology preserving maps of data based on probabilistic mixture models. Our approach is applicable to any mixture model for which we have a normal EM algorithm. Compared to other mixture model approaches to self-organizing maps, the function our algorithm maximizes has a clear interpretation: it sums data log-likelihood and a pen...

متن کامل

Probabilistic Voice Conversion Using Gaussian Mixture Models

This paper explores the topic of voice conversion as explored in a joint project with Percy Liang (EECS, Berkeley). For our purposes, voice conversion is the process of modifying the speech signal of one speaker (source) so that it sounds as thought it had been pronounced by a different speaker (target). By using a Gaussian mixture model (GMM) to model the features of the source speaker, we can...

متن کامل

Learning Self-organizing Mixture Markov Models

This paper describes a new algorithm to learn SelfOrganizing map as Markov Mixture Models. Our model realizes an unsupervised learning using unlabelled evolutionary data sets, namely those that describe sequential data. The new formalism that we present is valid for all structure of graphical models. We use EM (Expectation-Maximisation) standard algorithm to maximize the likelihood. The graph s...

متن کامل

Supporting Maritime Situation Awareness Using Self Organizing Maps and Gaussian Mixture Models

Maritime situation awareness is of importance in a lot of areas – e.g. detection of weapon smuggling in military peacekeeping operations, and harbor traffic control missions for the coast guard. In this paper, we have combined the use of Self Organizing Maps with Gaussian Mixture Models, in order to enable situation awareness by detecting deviations from normal behavior in an unsupervised way. ...

متن کامل

Gaussian Mixture Modeling with Gaussian Process Latent Variable Models

Density modeling is notoriously difficult for high dimensional data. One approach to the problem is to search for a lower dimensional manifold which captures the main characteristics of the data. Recently, the Gaussian Process Latent Variable Model (GPLVM) has successfully been used to find low dimensional manifolds in a variety of complex data. The GPLVM consists of a set of points in a low di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2023

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2023.3256923